Eliminating Unbounded Search in Computable Algebra
نویسنده
چکیده
Klaimullin, Melnikov and Ng [KMNa] have recently suggested a new systematic approach to algorithms in algebra which is intermediate between computationally feasible algebra [CR91, KNRS07] and abstract computable structure theory [AK00, EG00]. In this short survey we discuss some of the key results and ideas of this new topic [KMNa, KMNc, KMNb, Ala]. We also suggest several open problems.
منابع مشابه
Unbounded Recursion and Non-size-increasing Functions
We investigate the computing power of function algebras defined by means of unbounded recursion on notation. We introduce two function algebras which contain respectively the regressive logspace computable functions and the non-size-increasing logspace computable functions. However, such algebras are unlikely to be contained in the set of logspace computable functions because this is equivalent...
متن کاملA characterization of computable analysis on unbounded domains using differential equations
The functions of computable analysis are defined by enhancing normal Turing machines to deal with real number inputs. We consider characterizations of these functions using function algebras, known as real recursive functions. Since there are numerous incompatible models of computation over the reals, it is interesting to find that the two very different models we consider can be set up to yiel...
متن کاملFilters on Computable Posets
We explore the problem of constructing maximal and unbounded filters on computable posets. We obtain both computability results and reverse mathematics results. A maximal filter is one that does not extend to a larger filter. We show that every computable poset has a ∆2 maximal filter, and there is a computable poset with no Π1 or Σ 0 1 maximal filter. There is a computable poset on which every...
متن کاملNumerical solution of Fredholm integral-differential equations on unbounded domain
In this study, a new and efficient approach is presented for numerical solution of Fredholm integro-differential equations (FIDEs) of the second kind on unbounded domain with degenerate kernel based on operational matrices with respect to generalized Laguerre polynomials(GLPs). Properties of these polynomials and operational matrices of integration, differentiation are introduced and are ultili...
متن کاملParallel Minimax Searching Algorithm for Extremum of Unimodal Unbounded Function
In this paper we consider a parallel algorithm that detects the maximizer of unimodal function ( ) f x computable at every point on unbounded interval (0, ) . The algorithm consists of two modes: scanning and detecting. Search diagrams are introduced as a way to describe parallel searching algorithms on unbounded intervals. Dynamic programming equations, combined with a series of liner progra...
متن کامل